QDist-quartet distance between evolutionary trees
نویسندگان
چکیده
SUMMARY QDist is a program for computing the quartet distance between two unrooted trees, i.e. the number of quartet topology differences between the trees, where a quartet topology is the topological subtree induced by four species. The program is based on an algorithm with running time O(n log2 n), which makes it practical to compare large trees. Available under GNU license. AVAILABILITY http://www.birc.dk/Software/QDist
منابع مشابه
Algorithms for Computing the Quartet Distance
Evolutionary (Phylogenetic) trees are constructs of the biological and medical sciences, their purpose is to establish the relationship between a set of species (phyla). Often it is the case that the true evolutionary tree is unknown and one can only try to estimate it. Reconstruction methods are manifold and the resulting evolutionary trees are not guaranteed to be correct. In order to establi...
متن کاملComputing the Quartet Distance Between Trees of Arbitrary Degree
We present two algorithms for computing the quartet distance between trees of arbitrary degree. The quartet distance between two unrooted evolutionary trees is the number of quartets—sub-trees induced by four leaves—that differs between the trees. Previous algorithms focus on computing the quartet distance between binary trees. In this paper, we present two algorithms for computing the quartet ...
متن کاملComputing the Quartet Distance Between Evolutionary Trees of Bounded Degree
We present an algorithm for calculating the quartet distance between two evolutionary trees of bounded degree on a common set of n species. The previous best algorithm has running time O(d2n2) when considering trees, where no node is of more than degree d. The algorithm developed herein has running time O(d9n log n)) which makes it the first algorithm for computing the quartet distance between ...
متن کاملComputing the All-Pairs Quartet Distance on a Set of Evolutionary Trees
We present two algorithms for calculating the quartet distance between all pairs of trees in a set of binary evolutionary trees on a common set of species. The algorithms exploit common substructure among the trees to speed up the pairwise distance calculations, thus performing significantly better on large sets of trees compared to performing distinct pairwise distance calculations, as we illu...
متن کاملComputing the Quartet Distance Between Trees of Arbitrary Degrees
Comparing trees with regard to their topology is in itself an interesting theoretical problem in computer science, and furthermore researchers working in the interdisciplinary field of computational biology need tools to compare phylogenetic trees, i.e. trees that describe the relation of species according to evolutionary history. Different methods and different information can result in differ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Bioinformatics
دوره 20 10 شماره
صفحات -
تاریخ انتشار 2004